Computing Euclidean Steiner trees over segments
نویسندگان
چکیده
منابع مشابه
Approximate Euclidean Steiner Trees
An approximate Steiner tree is a Steiner tree on a given set of terminals in Euclidean space such that the angles at the Steiner points are within a specified error from 120◦. This notion arises in numerical approximations of minimum Steiner trees. We investigate theworst-case relative error of the length of an approximate Steiner tree compared to the shortest tree with the same topology. It ha...
متن کاملComputing Steiner minimal trees in Euclidean d-space
In this paper, we propose modifications on Smith’s branch-and-bound (B&B) algorithm for the Euclidean Steiner problem in R. At each node of the B&B tree, we solve a convex programming problem in conic form to obtain a lower bound on the minimal Steiner tree length for a given topology. We also use conic formulation to obtain bounds on the child problems at a given node, that are applied on a st...
متن کاملFaster Exact Algorithms for Computing Steiner Trees in Higher Dimensional Euclidean Spaces
The Euclidean Steiner tree problem asks for a network of minimum total length interconnecting a finite set of points in d-dimensional space. For d ≥ 3, only one practical algorithmic approach exists for this problem — proposed by Smith in 1992. A number of refinements of Smith’s algorithm have increased the range of solvable problems a little, but it is still infeasible to solve problem instanc...
متن کاملAn improved algorithm for computing Steiner minimal trees in Euclidean d-space
We describe improvements to Smith’s branch-and-bound (B&B) algorithm for the Euclidean Steiner problem in IR. Nodes in the B&B tree correspond to full Steiner topologies associated with a subset of the terminal nodes, and branching is accomplished by “merging” a new terminal node with each edge in the current Steiner tree. For a given topology we use a conic formulation for the problem of locat...
متن کاملAn Hierarchic Genetic Algorithm for Computing (near)Optimal Euclidean Steiner Trees
In this paper we present an heuristic for finding a near-optimal Euclidean Steiner Tree for a given set of terminal points. This is defined as the shortest length geometric construction that unites all the terminals. Our algorithm dynamically partitions the point set into multiple, separately optimized subsets. The Steiner tree for these subsets is constructed by running a highly modified genet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURO Journal on Computational Optimization
سال: 2020
ISSN: 2192-4406,2192-4414
DOI: 10.1007/s13675-020-00125-w